Formal languages - PDFSEARCH.IO - Document Search Engine

Formal languages
Results: 2429

#	Item
371	GUARDED TRANSFORMATION FOR THE MODAL µ-CALCULUS FLORIAN BRUSE, OLIVER FRIEDMANN, AND MARTIN LANGE Abstract. Guarded normal form requires occurrences of fixpoint variables in a µ-calculus-formula to occur under the scop Add to Reading List Source URL: files.oliverfriedmann.de Language: English - Date: 2013-05-03 12:27:57 Mathematical logic Metalogic Well-formed formula Conjunctive normal form Polynomial Parity Physics Formal languages Logical syntax
372	JMLR: Workshop and Conference Proceedings 34:139–152, 2014 Proceedings of the 12th ICGI Grammatical Inference of some Probabilistic Context-Free Grammars from Positive Data using Minimum Satisfiability Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Grammar Context-free grammar Stochastic context-free grammar Chomsky normal form Formal grammar CYK algorithm LL parser Regular language Grammar induction Formal languages Linguistics Logic
373	Building a Calculus of Data Structures Viktor Kuncak1⋆ , Ruzica Piskac1 , Philippe Suter1 , and Thomas Wies2 1 EPFL School of Computer and Communication Sciences, Lausanne, Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2009-11-10 09:06:44 Model theory Metalogic Proof theory Logic in computer science Formal languages First-order logic Multiset Presburger arithmetic Quantifier elimination Logic Mathematics Mathematical logic
374	JMLR: Workshop and Conference Proceedings 34:49–63, 2014 Proceedings of the 12th ICGI A bottom-up efficient algorithm learning substitutable languages from positive examples Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Software engineering String Regular language Context-free grammar Formal grammar Regular expression Algorithm Formal languages Combinatorics Mathematics
375	SMT Solvers: Theory and Implementation Summer School on Logic and Theorem Proving Leonardo de Moura Microsoft Research Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 Model theory Predicate logic Formal languages Metalogic Satisfiability Modulo Theories Interpretation Well-formed formula Structure Term Logic Mathematical logic Mathematics
376	Katahdin Mutating a Programming Language’s Syntax and Semantics at Runtime Chris Seaton The University of Bristol Add to Reading List Source URL: www.chrisseaton.com Language: English - Date: 2013-03-27 03:32:35 Computing Computer programming Parsing expression grammar Recursive descent parser LL parser Left recursion LR parser Operator associativity Syntax Software engineering Formal languages Parsing
377	MOUSE : FROM PARSING EXPRESSIONS TO A PRACTICAL PARSER VersionRoman R. Redziejowski Parsing Expression Grammar (PEG) is a new way to specify recursive-descent parsers with Add to Reading List Source URL: mousepeg.sourceforge.net Language: English - Date: 2014-05-13 09:03:26 Formal languages Compiler construction Software engineering Parsing expression grammar Top-down parsing language LL parser Recursive descent parser Top-down parsing Lookahead Programming language implementation Parsing Computing
378	JMLR: Workshop and Conference Proceedings 34:21–32, 2014 Proceedings of the 12th ICGI Towards a rationalist theory of language acquisition Edward Stabler Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Combinatorics Regular language Poverty of the stimulus Formal grammar Context-free grammar Language acquisition Verb phrase Universal grammar Parsing Formal languages Linguistics Language
379	Manuel Hermenegildo Areas of Interest Energy-Aware Computing, Resource / non-functional property analysis, verification, and control; Global Program Analysis, Optimization, Verification, Debugging; Abstract Interpretatio Add to Reading List Source URL: www.clip.dia.fi.upm.es Language: English - Date: 2014-07-12 00:42:10 Programming paradigms Formal sciences Association for Computing Machinery Principles of Programming Languages Formal methods International Conference on Logic Programming Logic programming International Symposium on Logic-based Program Synthesis and Transformation Lecture Notes in Computer Science Computer science Computing Software engineering
380	Concise Integer Linear Programming Formulations for Dependency Parsing ∗ Andr´e F. T. Martins∗† Noah A. Smith∗ Eric P. Xing∗ School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-05-19 09:57:02 Compiler construction Formal languages LL parser Dependency grammar Linear programming Parse tree Conditional random field Combinatory logic Directed graph Mathematics Graph theory Theoretical computer science

UPDATE